Automated model repair for distributed programs
نویسندگان
چکیده
منابع مشابه
Automated Systematic Testing of Open Distributed Programs
We present an algorithm for automatic testing of distributed programs, such as Unix processes with inter-process communication, Web services, etc. Specifically, we assume that a program consists of a number of asynchronously executing concurrent processes or actors which may take data inputs and communicate using asynchronous messages. Because of the large numbers of possible data inputs as wel...
متن کاملModel Extraction for Sockets-based Distributed Programs
The following short report introduces an approach to utilize unbounded, reliable fifo queues as basis for an operational semantics of distributed applications whose implementation is based on the Berkeley Sockets Api. After a sketch of Tcp and the Sockets Api, a first draft of a formalization of distributed programs is given as well as a straight-forward translation into the abstract formal mod...
متن کاملMaintenance Cost Analysis for Replacement Model with Perfect Minimal Repair
With the evolution of technology, the maintenance of sophisticated systems is of concern for system engineers and system designers. The maintenance cost of the system depends in general on the replacement and repair policies. The system replacement may be in a strictly periodic fashion or on a random basis depending upon the maintenance policy. At failure, the repair of the system may be perfor...
متن کاملAutomated reasoning for reflective programs
class Visitor {visit(Object obj) {try {Class obj_class = obj.getClass();String obj_className = obj_class.getName();String methodName = "visit" + obj_className;Class this_class = this.getClass();Method method = this_class.getMethod(methodName, obj_class);method.invoke(this, obj);}catch (NoSuchMethodException e) { }catch (IllegalAccessException e) { }<l...
متن کاملConfluence Analysis for Distributed Programs: A Model-Theoretic Approach
Building on recent interest in distributed logic programming, we take a model-theoretic approach to analyzing confluence of asynchronous distributed programs. We begin with a model-theoretic semantics for Dedalus and introduce the ultimate model, which captures non-deterministic eventual outcomes of distributed programs. After showing the question of confluence undecidable for Dedalus, we ident...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGACT News
سال: 2012
ISSN: 0163-5700
DOI: 10.1145/2261417.2261437